Back Neighbor-joining Catalan Neighbor-Joining-Algorithmus German Método de unión de vecinos Spanish اتصال-همسایگی Persian Neighbour joining French 近隣結合法 Japanese Метод присоединения соседей Russian Метод приєднання сусідів Ukrainian 邻接法 Chinese
In bioinformatics, neighbor joining is a bottom-up (agglomerative) clustering method for the creation of phylogenetic trees, created by Naruya Saitou and Masatoshi Nei in 1987.[1] Usually based on DNA or protein sequence data, the algorithm requires knowledge of the distance between each pair of taxa (e.g., species or sequences) to create the phylogenetic tree.[2]
- ^ Saitou, N.; Nei, M. (1 July 1987). "The neighbor-joining method: a new method for reconstructing phylogenetic trees". Molecular Biology and Evolution. 4 (4): 406–425. doi:10.1093/oxfordjournals.molbev.a040454. PMID 3447015.
- ^ Xavier Didelot (2010). "Sequence-Based Analysis of Bacterial Population Structures". In D. Ashley Robinson; Daniel Falush; Edward J. Feil (eds.). Bacterial Population Genetics in Infectious Disease. John Wiley and Sons. pp. 46–47. ISBN 978-0-470-42474-2.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search